全文获取类型
收费全文 | 2058篇 |
免费 | 124篇 |
国内免费 | 69篇 |
专业分类
化学 | 320篇 |
晶体学 | 2篇 |
力学 | 50篇 |
综合类 | 37篇 |
数学 | 1579篇 |
物理学 | 263篇 |
出版年
2023年 | 24篇 |
2022年 | 38篇 |
2021年 | 43篇 |
2020年 | 41篇 |
2019年 | 33篇 |
2018年 | 48篇 |
2017年 | 46篇 |
2016年 | 53篇 |
2015年 | 41篇 |
2014年 | 84篇 |
2013年 | 138篇 |
2012年 | 100篇 |
2011年 | 116篇 |
2010年 | 109篇 |
2009年 | 142篇 |
2008年 | 163篇 |
2007年 | 155篇 |
2006年 | 94篇 |
2005年 | 108篇 |
2004年 | 100篇 |
2003年 | 60篇 |
2002年 | 60篇 |
2001年 | 62篇 |
2000年 | 69篇 |
1999年 | 47篇 |
1998年 | 43篇 |
1997年 | 33篇 |
1996年 | 37篇 |
1995年 | 28篇 |
1994年 | 18篇 |
1993年 | 20篇 |
1992年 | 14篇 |
1991年 | 8篇 |
1990年 | 8篇 |
1989年 | 6篇 |
1988年 | 9篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 8篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1973年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有2251条查询结果,搜索用时 46 毫秒
1.
2.
为解决深度学习在图像水印算法中计算量大且模型冗余的问题,提高图像水印算法在抵抗噪声、旋转和剪裁等攻击时的鲁棒性,提出基于快速神经网络架构搜索(neural architecture search,NAS)的鲁棒图像水印网络算法。通过多项式分布学习快速神经网络架构搜索算法,在预设的搜索空间中搜索最优网络结构,进行图像水印的高效嵌入与鲁棒提取。首先,将子网络中线性连接的全卷积层设置为独立的神经单元结构,并参数化表示结构单元内节点的连接,预先设定结构单元内每个神经元操作的搜索空间;其次,在完成一个批次的数据集训练后,依据神经元操作中的被采样次数和平均损失函数值动态更新概率;最后,重新训练搜索完成的网络。水印网络模型的参数量较原始网络模型缩减了92%以上,大大缩短了模型训练时间。由于搜索得到的网络结构更为紧凑,本文算法具有较高的时间性能和较好的实验效果,在隐藏图像时,对空域信息的依赖比原始网络更少。对改进前后的2个网络进行了大量鲁棒性实验,对比发现,本文算法在CIFAR-10数据集上对抵抗椒盐噪声和旋转、移除像素行(列)等攻击优势显著;在ImageNet数据集上对抵抗椒盐高斯噪声、旋转、中值滤波、高斯滤波、JPEG压缩、裁剪等攻击优势显著,特别是对随机移除行(列)和椒盐噪声有较强的鲁棒性。 相似文献
3.
《Stochastic Processes and their Applications》2020,130(5):2954-2973
We consider a stochastic search model with resetting for an unknown stationary target with known distribution . The searcher begins at the origin and performs Brownian motion with diffusion constant . The searcher is also armed with an exponential clock with spatially dependent rate , so that if it has failed to locate the target by the time the clock rings, then its position is reset to the origin and it continues its search anew from there. Denote the position of the searcher at time by . Let denote expectations for the process . The search ends at time . The expected time of the search is then . Ideally, one would like to minimize this over all resetting rates . We obtain quantitative growth rates for as a function of in terms of the asymptotic behavior of the rate function , and also a rather precise dichotomy on the asymptotic behavior of the resetting function to determine whether is finite or infinite. We show generically that if is of the order , with , then is of the order ; in particular, the smaller the asymptotic size of , the smaller the asymptotic growth rate of . The asymptotic growth rate of continues to decrease when with ; now the growth rate of is more or less of the order . Note that this exponent increases to when increases to and decreases to 2 when decreases to 1. However, if , then , for . Our results suggest that for many distributions supported on all of , a near optimal (or optimal) choice of resetting function in order to minimize will be one which decays quadratically as for some . We also give explicit, albeit rather complicated, variational formulas for . For distributions with compact support, one should set off of the support. We also discuss this case. 相似文献
4.
Cheng and Tang [Biometrika, 88 (2001), pp. 1169–1174] derived an upper bound on the maximum number of columns that can be accommodated in a two‐symbol supersaturated design (SSD) for a given number of rows () and a maximum in absolute value correlation between any two columns (). In particular, they proved that for (mod ) and . However, the only known SSD satisfying this upper bound is when . By utilizing a computer search, we prove that for , and . These results are obtained by proving the nonexistence of certain resolvable incomplete blocks designs. The combinatorial properties of the RIBDs are used to reduce the search space. Our results improve the lower bound for SSDs with rows and columns, for , and . Finally, we show that a skew‐type Hadamard matrix of order can be used to construct an SSD with rows and columns that proves . Hence, we establish for and for all (mod ) such that . Our result also implies that when is a prime power and (mod ). We conjecture that for all and (mod ), where is the maximum number of equiangular lines in with pairwise angle . 相似文献
5.
6.
针对若干远海岛礁群系统封闭性的分布特点,将中心岛礁选址、各岛礁建设泊位数量和规模、仓库储存量、运输船型和数量以及航线设置、班期组织等作为规划内容,以整个运输网络系统总成本最低为原则,综合考虑了仓库存储理论,建立了兼顾“选址-库存-路径”的规划模型。结合所建模型特点,提出了双层并行搜索遗传算法,构建了以海上运输为基本交通方式的双向物流系统。最后,以我国南海为例进行建模并求解,采用不同算法并通过多组不同规模的算例进行演算比较,验证了所建模型和算法的有效性与合理性。 相似文献
7.
8.
One of the major capacity boosters for 5G networks is the deployment of ultra-dense heterogeneous networks (UDHNs). However, this deployment results in a tremendous increase in the energy consumption of the network due to the large number of base stations (BSs) involved. In addition to enhanced capacity, 5G networks must also be energy efficient for it to be economically viable and environmentally friendly. Dynamic cell switching is a very common way of reducing the total energy consumption of the network, but most of the proposed methods are computationally demanding, which makes them unsuitable for application in ultra-dense network deployment with massive number of BSs. To tackle this problem, we propose a lightweight cell switching scheme also known as Threshold-based Hybrid cEll swItching Scheme (THESIS) for energy optimization in UDHNs. The developed approach combines the benefits of clustering and exhaustive search (ES) algorithm to produce a solution whose optimality is close to that of the ES (which is guaranteed to be optimal), but is computationally more efficient than ES and as such can be applied for cell switching in real networks even when their dimension is large. The performance evaluation shows that THESIS significantly reduces the energy consumption of the UDHN and can reduce the complexity of finding a near-optimal solution from exponential to polynomial complexity. 相似文献
9.
Zhensheng Yu Yangchen Liu Xinyue Gan 《Numerical Functional Analysis & Optimization》2017,38(11):1458-1472
This paper presents a nonmonotone inexact Newton-type method for the extended linear complementarity problem (ELCP). We first reformulate the optimization system of the ELCP problem into a system of smoothed equations. Then we solve this system by a nonmonotone inexact Newton-type algorithm. The global convergence is obtained and numerical tests for some classes of ELCP include linear complementarity, horizontal linear complementarity, and generalized linear complementarity problems are also given to show the e?ciency of the proposed algorithm. 相似文献
10.
《Journal of separation science》2017,40(9):1906-1919
Valeriana jatamansi Jones is an important medicinal plant and its quality is closely related to its region of origin. In the current study, we utilized a flexible and powerful strategy for comprehensive evaluation of the quality diversity for 15 regions in China. The method was based on a hybrid linear ion trap‐Orbitrap mass spectrometry platform. For structure characterization, fragmentation patterns were detected by analyzing a series of standard compounds using data dependent multistage mass spectrometry acquisition. A fragment ion database for valepotriates was established, and the acquired data were high throughput filtered by fragment ion search for compound identification. For quantitative purposes, we normalized the mass spectrometry data of 15 samples using SIEVE 2.0 and the differences in composition were analyzed using principal component analysis combined with hierarchical clustering analysis. The results identified a total of 92 compounds from Valeriana jatamansi Jones. Samples from Dali, Kunming, and Baoshan have better qualities and concentrations of the main active constituents. To verify our strategy, we compared the valtrate, acevaltrate, and baldrinal contents using high‐performance liquid chromatography with diode array detector. We developed and validated a comprehensive qualitative and quantitative analytical method to achieve quality control of Valeriana jatamansi Jones. 相似文献